The Minimum Code Length for Clustering Using the Gray Code
نویسندگان
چکیده
منابع مشابه
Gray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملExtending the Radar Dynamic Range using Adaptive Pulse Compression
The matched filter in the radar receiver is only adapted to the transmitted signal version and its output will be wasted due to non-matching with the received signal from the environment. The sidelobes amplitude of the matched filter output in pulse compression radars are dependent on the transmitted coded waveforms that extended as much as the length of the code on both sides of the target loc...
متن کاملClustering Change Detection Using Normalized Maximum Likelihood Coding
We are concerned with the issue of detecting changes of clustering structures from multivariate time series. From the viewpoint of the minimum description length (MDL) principle, we introduce an algorithm that tracks changes of clustering structures so that the sum of the code-length for data and that for clustering changes is minimum. Here we employ a Gaussian mixture model (GMM) as representa...
متن کاملBehavior of a Tunnel and its Neighboring Joint with and without Presence of Rock Bolt under Biaxial Loads; Particle Flow Code Approach
In this work, the interaction between the semi-circular space and the neighboring joint with and without the presence of rock bolts was investigated using the particle flow code (PFC) approach. For this purpose, firstly, the calibration of PFC was performed using both the Brazilian experimental test and the uniaxial compression test. Secondly, a numerical model with the dimension of 100 m...
متن کاملA new series of Z4-linear codes of high minimum Lee distance derived from the Kerdock codes
A new series of Z4-linear codes of high minimum Lee distance is given. It is derived from the Z4-linear representation of the Kerdock codes. The Gray image of the smallest of these codes is a nonlinear binary (114, 2, 56)-code, and in the second smallest case the Gray image is a nonlinear binary (1988, 2, 992)-code. Both codes have at least twice as many codewords as any linear binary code of e...
متن کامل